A Reconfiguration Algorithm for Power-Aware Parallel Applications
نویسندگان
چکیده
منابع مشابه
Power aware reconfigurations of parallel applications
Current architectures provide many possibilities for the reduction of power consumption of applications, such as reducing the number of used cores or scaling down their frequency. However, the amount of resources allocated to an application is usually static and fixed by the programmer or by the runtime. While there are cases where such a static choice may be appropriate, other scenarios may re...
متن کاملRuntime Power-Aware Energy-Saving Scheme for Parallel Applications
Energy consumption has become a major design constraint in modern computing systems. With the advent of peta ops architectures, power efficient software stacks have become imperative for scalability. Modern processors provide techniques, such as dynamic voltage and frequency scaling (DVFS), to improve energy efficiency on-the-fly. Without careful application, however, DVFS and throttling may ca...
متن کاملOptimal Reconfiguration of Distribution Network for Power Loss Reduction and Reliability Improvement Using Bat Algorithm
In power systems, reconfiguration is one of the simplest and most low-cost methods to reach many goals such as self-healing, reliability improvement, and power loss reduction, without including any additional components. Regarding the expansion of distribution networks, communications become more complicate and the number of parameters increases, which makes the reconfiguration problem infeasib...
متن کاملA Power-Aware Routing Algorithm∗
Communication-related operations are a major source of energy consumption in mobile nodes. In particular, consumption is significantly high when ad hoc routing is employed as nodes are assigned additional operations to support the routing of packets from other nodes. This research extends the cognitive packet networks initiative to support routing of packets in wireless, mobile ad hoc networks....
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2016
ISSN: 1544-3566,1544-3973
DOI: 10.1145/3004054